Polynomial time quantum computation with advice

Advice is supplementary information that enhances the computational power of an underlying computation. This paper focuses on advice that is given in the form of a pure quantum state. The notion of advised quantum computation has a direct connection to non-uniform quantum circuits and tally languages. The paper examines the influence of such advice on the behaviors of an underlying polynomial-time quantum computation with bounded-error probability and shows a power and a limitation of advice.